The Parameterized Complexity Analysis of Partition Sort for Negative Binomial Distribution Inputs
نویسندگان
چکیده
The present paper makes a study on Partition sort algorithm for negative binomial inputs. Comparing the results with those for binomial inputs in our previous work, we find that this algorithm is sensitive to parameters of both distributions. But the main effects as well as the interaction effects involving these parameters and the input size are more significant for negative binomial case.
منابع مشابه
Shift-insertion Sort Revisited: Another Statistical Case Study on Parameterized Complexity Using Factorial Experiments
The present paper makes use of factorial experiments to assess software complexity for negative binomial distribution inputs using a new sorting algorithm which we call shift-insertion sort (insertion sort with shifting). Copyright c © 2011 Yang’s Scientific Research Institute, LLC. All rights reserved.
متن کاملPartition Sort Revisited: Reconfirming the Robustness in Average Case and much more!
In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick sort. In our first study in this paper, we reconfirm this through computer experiments for inputs from Cauchy distribution for which expectation theoretically does not exist. Additionally, the algorithm is found to be sensitive to parameters of...
متن کاملA Statistical Comparative Study of Some Sorting Algorithms
This research paper is a statistical comparative study of a few average case asymptotically optimal sorting algorithms namely, Quick sort, Heap sort and Ksort. The three sorting algorithms all with the same average case complexity have been compared by obtaining the corresponding statistical bounds while subjecting these procedures over the randomly generated data from some standard discrete an...
متن کاملLinear Search versus Binary Search: a Statistical Comparison for Binomial Inputs
For certain algorithms such as sorting and searching, the parameters of the input probability distribution, in addition to the size of the input, have been found to influence the complexity of the underlying algorithm. The present paper makes a statistical comparative study on parameterized complexity between linear and binary search algorithms for binomial inputs.
متن کاملHow does the Shift-insertion sort behave when the sorting elements follow a Normal distribution?
The present paper examines the behavior of Shift-insertion sort (insertion sort with shifting) for normal distribution inputs and is in continuation of our earlier work on this new algorithm for discrete distribution inputs, namely, negative binomial. Shift insertion sort is found more sensitive for main effects but not for all interaction effects compared to conventional insertion sort.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1204.5023 شماره
صفحات -
تاریخ انتشار 2012